منابع مشابه
Finite Tree Automata with Cost Functions
Cost functions for tree automata are mappings from transitions to (tuples o0 polynomials over some semiring. We consider four semirings, namely N the semiring of nonnegative integers, A the "arctical semiring", T the tropical semiring and F the semiring of finite subsets of nonnegative integers. We show: for semirings N and A it is decidable in polynomial time whether or not the costs of accept...
متن کاملCost Functions Definable by Min/Max Automata
Regular cost functions form a quantitative extension of regular languages that share the array of characterisations the latter possess. In this theory, functions are treated only up to preservation of boundedness on all subsets of the domain. In this work, we subject the well known distance automata (also calledmin-automata), and their dualmax-automata to this framework, and obtain a number of ...
متن کاملRegular Functions, Cost Register Automata, and Generalized Min-Cost Problems
Motivated by the successful application of the theory of regular languages to formal verification of finite-state systems, there is a renewed interest in developing a theory of analyzable functions from strings to numerical values that can provide a foundation for analyzing quantitative properties of finite-state systems. In this paper, we propose a deterministic model for associating costs wit...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملReal Functions computed by Parametric Weighted Finite Automata
Weighted finite automata (WFA) are an extension of finite automata that can be used to compute real functions and parametric WFA (PWFA) are a multidimensional variant of WFA. This paper shows that each PWFA computable set is computable by a PWFA that has an alphabet cardinality of two. Further we show that real polynomials with solely rational coefficients can be computed by PWFA that do not us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1976
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(76)80005-8